k-Uniform rotundity is equivalent to k-uniform convexity
نویسندگان
چکیده
منابع مشابه
Packing k-partite k-uniform hypergraphs
Let G and H be k-graphs (k-uniform hypergraphs); then a perfect H-packing in G is a collection of vertex-disjoint copies of H in G which together cover every vertex ofG. For any fixed k-graphH let δ(H,n) be the minimum δ such that any k-graphG on n vertices with minimum codegree δ(G) ≥ δ contains a perfect H-packing. The problem of determining δ(H,n) has been widely studied for graphs (i.e. 2-g...
متن کاملC-Perfect K-Uniform Hypergraphs
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer k,p and q, 2q ≤ p we construct a k-uniform hypergraph H with small clique number whose circular chromatic number equals p q . We define the concept and study the properties of c-perfect k-uniform hypergraphs .
متن کاملOn uniform k-partition problems
We study various uniform k-partition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems differ according to the particular measure of “set uniformity” to be optimized. Most problems are polynomial and corresponding solution algorithms are provided. A fe...
متن کاملRamsey Properties of Random k-Partite, k-Uniform Hypergraphs
We investigate the threshold probability for the property that every r-coloring of the edges of a random binomial k-uniform hypergraph G(k)(n, p) yields a monochromatic copy of some fixed hypergraph G. In this paper we solve the problem for arbitrary k ≥ 3 and k-partite, k-uniform hypergraphs G.
متن کاملTowards Community Detection in k-Partite k-Uniform Hypergraphs
Recently, numerous applications have emerged that create data most naturally interpreted as k-partite k-uniform hypergraphs. We identify benefits and challenges of generalizing community detection algorithms to these structures. We propose an algorithm which handles some of these challenges and a hypergraph generalization of the “caveman” model for the generation of synthetic evaluation dataset...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1988
ISSN: 0022-247X
DOI: 10.1016/0022-247x(88)90066-2